// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
signed main()
{
	int n,m,a,b;
	cin>>n>>m;
	vector<int> v[n+1],ans(n+1);
	
	for(int i=1;i<=m;i++)
	{
		cin>>a>>b;
		v[b].push_back(a);
	}
	for(int i=n;i>=1;i--)
	{
		if(!ans[i])ans[i]=i;
		queue<int> q;
		q.push(i);
		while(!q.empty())
		{
			int x=q.front();
			q.pop();
			for(int j=0;j<v[x].size();j++)
			{
				if(!ans[v[x][j]])
				{
					ans[v[x][j]]=i;
					q.push(v[x][j]);
				}
			}
		}
	}
	for(int i=1;i<=n;i++)
		cout<<ans[i]<<" ";
	return 0;
}
